Fully abstract semantics of λμ in the π-calculus
نویسندگان
چکیده
We study the λμ-calculus, extended with explicit substitution, and study a logic-based compositional output-based translation into a variant of the π-calculus with pairing that preserves single-step explicit head reduction with respect to contextual equivalence. We will define two notions of equality for λμ, modelling explicit head-reduction, head reduction, and show they coincide. We define four notions of equivalence, two as extensions of the equalities, one based on reduction (considering terms without head-normal form equivalent as well), and one based on approximation, and show they all coincide. We will also define four notions of weak equivalence, where now we consider terms without weak head-normal form equivalent, that all coincide as well. We will then show full abstraction results for our translation for the weak equivalences with respect to contextually equivalence on processes.
منابع مشابه
A fully-abstract semantics of lambda-mu in the pi-calculus
We study the λμ-calculus, extended with explicit substitution, and define a compositional outputbased interpretation into a variant of the π-calculus with pairing that preserves single-step explicit head reduction with respect to weak bisimilarity. We define four notions of weak equivalence for λμ – one based on weak reduction ∼wβμ, two modelling weak head-reduction and weak explicit head reduc...
متن کاملAn Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus - Extended Abstract
We study the Λμ-calculus, extended with explicit substitution, and define a compositional output-based translation into a variant of the π-calculus with pairing. We show that this translation preserves single-step explicit head reduction with respect to contextual equivalence. We use this result to show operational soundness for head reduction, adequacy, and operational completeness. Using a no...
متن کاملProcess Types as a Descriptive Tool for Interaction - Control and the Pi-Calculus
We demonstrate a tight relationship between linearly typed π-calculi and typed λ-calculi by giving a type-preserving translation from the call-by-value λμ-calculus into a typed π-calculus. The λμ-calculus has a particularly simple representation as typed mobile processes. The target calculus is a simple variant of the linear π-calculus. We establish full abstraction up to maximally consistent o...
متن کاملA fully abstract coalgebraic semantics for the pi-calculus under weak bisimilarity
Combining traces, coalgebra and lazy-filtering channel configurations for parallel composition, we give a fully-abstract denotational semantics for the π-calculus under weak early bisimilarity.
متن کاملClassical logic, continuation semantics and abstract machines
One of the goals of this paper is to demonstrate that denotational semantics is useful for operational issues like implementation of functional languages by abstract machines. This is exemplified in a tutorial way by studying the case of extensional untyped call-byname λ-calculus with Felleisen’s control operator C. We derive the transition rules for an abstract machine from a continuation sema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013